منابع مشابه
Quantum Computers Speed Up Classical with Probability Zero
Let f denote length preserving function on words. A classical algorithm can be considered as T iterated applications of black box representing f , beginning with input word x of length n. It is proved that if T = O(2 n 7+ε ), ε > 0, and f is chosen randomly then with probability 1 every quantum computer requires not less than T evaluations of f to obtain the result of classical computation. It ...
متن کاملA flexible zero-inflated model to address data dispersion
Excess zeroes are often thought of as a cause of data over-dispersion (i.e. when the variance exceeds the mean); this claim is not entirely accurate. In actuality, excess zeroes reduce the mean of a dataset, thus inflating the dispersion index (i.e. the variance divided by the mean). While this results in an increased chance for data over-dispersion, the implication is not guaranteed. Thus, one...
متن کاملOne Address Computers are Faster and Use Less Memory Space to Execute Arithmetic Assignment Statements
A notation is developed which permits space and time efficiemcy comparisons of four basic computer architectures in use today for executing Fortran-style assignment statements. From the com~arisona, we discover that a suitably designed l-address archit.cture (one accumulator machine) outperforms toe other architectures in speed of execution and in encoded size ~ compiled Fortran statements. The...
متن کاملAsymptotic Zero-Transition Activity Encoding for Address Busses in Low-Power Microprocessor-Based Systems
In microprocessor-based systems, large power savings can be achieved through reduction of the transition activity of the onand off-chip busses. This is because the total capacitance being switched when a voltage change occurs on a bus line i s usually sensibly larger than the capacitive load that must be charged/discharged when internal nodes toggle. I n this paper, we propose an encoding schem...
متن کاملA New Address-Free Memory Hierarchy Layer for Zero-Cycle Load
Data communications between producer instructions and consumer instructions through memory incur extra delays that degrade processor performance. In this paper, we introduce a new storage media with a novel addressing mechanism to avoid address calculations. Instead of a memory address, each load and store is assigned a signature for accessing the new storage. A signature consists of the color ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Computer Journal
سال: 1962
ISSN: 0010-4620,1460-2067
DOI: 10.1093/comjnl/5.1.15